/*!
 Temelia - tree algorithms interface.

 Copyright (C) 2008, 2009 Ceata (http://ceata.org/proiecte/temelia).

 @author Dascalu Laurentiu

 This program is free software; you can redistribute it and
 modify it under the terms of the GNU General Public License
 as published by the Free Software Foundation; either version 3
 of the License, or (at your option) any later version.

 This program is distributed in the hope that it will be useful,
 but WITHOUT ANY WARRANTY; without even the implied warranty of
 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 GNU General Public License for more details.

 You should have received a copy of the GNU General Public License
 along with this program; if not, write to the Free Software
 Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301, USA.
 */

#ifndef TREE_ALGORITHMS_H_
#define TREE_ALGORITHMS_H_

#include "platform.h"
#include "tree.h"

/*!
 * @brief Iterates over the tree nodes, traversing him in breadth-first order.
 * Complexity O(n)
 *
 * @param Tree
 * @param Pointer to iterating function
 * @param Context
 */
DECLSPEC void tree_bfs_iterate(tree_t tree, void key_handler(void *x, void *context),
		void *context);

/*!
 * @brief Iterates over the tree nodes, traversing him in depth-first order.
 * Complexity O(n) or O(n*n), depending on backbone implementation chosen
 * by the user: vector_t or linked_list_t.
 *
 * @param Pointer to tree
 * @param Pointer to iterating function
 * @param Pointer to context
 */
DECLSPEC void tree_dfs_iterate(tree_t tree, void key_handler(void *x, void *context),
		void *context);

#endif /* TREE_ALGORITHMS_H_ */
